home *** CD-ROM | disk | FTP | other *** search
/ Aminet 5 / Aminet 5 - March 1995.iso / Aminet / dev / misc / LEDA_gene.lha / LEDA-3.1c-generic / incl / LEDA / b_prio.h < prev    next >
Encoding:
C/C++ Source or Header  |  1994-08-05  |  1.5 KB  |  53 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  3.1c
  4. +
  5. +
  6. +  b_prio.h
  7. +
  8. +
  9. +  Copyright (c) 1994  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16. #ifndef LEDA_BPRIO_H
  17. #define LEDA_BPRIO_H
  18.  
  19. //------------------------------------------------------------------------------
  20. // b_priority_queues: bounded priority queues implemented by b_heaps 
  21. //------------------------------------------------------------------------------
  22.  
  23. #include <LEDA/impl/b_heap.h>
  24.  
  25. typedef b_heap_item b_pq_item;
  26.  
  27.  
  28. template<class keytype> 
  29.  
  30. class _CLASSTYPE b_priority_queue : public b_heap 
  31. {
  32. public:
  33.  
  34.          b_priority_queue(int a, int b): (a,b)  {}
  35. virtual ~b_priority_queue()  { }
  36.  
  37.   b_pq_item insert(keytype k,int info)
  38.                              { return b_heap::insert(info,Convert(k)); }
  39.   void decrease_inf(b_pq_item it,int newinf)
  40.                              { b_heap::decrease_key(it,newinf); }
  41.   void del_item(b_pq_item x) { b_heap::delete_item(x); }
  42.   int      inf(b_pq_item x)  { return b_heap::key(x); }
  43.   keytype  key(b_pq_item x)  { return ACCESS(keytype,b_heap::info(x)); }
  44.   keytype  del_min()         { return ACCESS(keytype,b_heap::del_min()); }
  45.   b_pq_item find_min()       { return b_heap::find_min(); }
  46.   void clear()               { b_heap::clear(); }
  47.   int empty()                { return (find_min()==0) ? true : false; }
  48.  };
  49.  
  50.  
  51. #endif
  52.  
  53.